Spiral MR Reconstruction Using FOCUSS
نویسندگان
چکیده
Introduction: Spiral data acquisition has gained in popularity over the past decade since it has several advantages over rectilinear acquisition methods. These advantages include short acquisition time and reduced sensitivity to flow artifacts. In spiral imaging, k-space data are efficiently collected along spiral trajectories during relatively long readout. Since the total number of TR cycles of spiral acquisition is usually significantly reduced from that of rectilinear acquisition, the total scan time can be reduced. However, further reduction of acquisition time would be desirable since it helps to reduce artifacts due to motion and/or off-resonance effects. Spiral sampling method using fewer spiral interleaves can achieve shorter acquisition time although the images are often affected by aliasing artifacts. Recent advancement of parallel imaging techniques enables us to reconstruct images with reduced aliasing artifacts [1]. Alternative approaches to reduce aliasing artifacts are to modify reconstruction methods taking advantage of specifically designed regularizations and/or constraints. Recently, the focal underdetermined system solver (FOCUSS) that was originally proposed for electroand magnetoencephalogram has successfully been adapted to angularly undersampled projection reconstruction (PR) in MRI [2]. PR-FOCUSS is an iteration algorithm that uses conjugate gradient (CG) method. A primary difference between FOCUSS and conventional CG method is that FOCUSS uses an image weighting matrix as a constraint and updates the weighting matrix during iterations. Images reconstructed using PR-FOCUSS are of high quality when compared with those using conventional CG method [2]. In this study, we show that FOCUSS can be extended to spiral trajectories. The newly proposed method is referred to as ‘Spiral FOCUSS’. When data are acquired using spiral trajectories with reduced interleaves, images reconstructed using Spiral FOCUSS substantially reduce aliasing artifacts from those reconstructed using conventional gridding [3]. Since PR-FOCUSS capitalizes on back-projection and reprojection [2], the algorithm of PR-FOCUSS could only be applied to radial k-space trajectories. However, since Spiral FOCUSS takes advantage of iterative next neighbor gridding (INNG) [4], k-space data are simply distributed to oversampled matrices and hence cumbersome convolution-based gridding is not required. Therefore, the algorithm of Spiral FOCUSS can essentially be applied to general non-uniform sampling methods. Spiral FOCUSS is a new, useful technique that reconstructs high-quality images from spiral data with reduced interleaves, thereby enabling us to further reduce scan time of spiral imaging. Methods: FOCUSS can be formulated as: min |q| s.t. AWq = y, where y is acquired data, W is an image weighting matrix, and A represents Fourier transform (FT). The solution q is to be computed using CG method with W updated during iterations. The reconstructed image x can be expressed as x=Wq. Procedures of FOCUSS are summarized in ref.[2]. In Spiral FOCUSS, INNG is utilized to efficiently perform CG algorithm on nonuniformly sampled data. Figure 1 shows a flow chart of Spiral FOCUSS. In Fig.1, small and large squares indicate N×N and sN× sN matrices, respectively, where N is the target reconstructed image size and s is a scaling factor of oversampled matrices [4]. An initial image estimate x0 is obtained after inverse FT is performed on the data that are distributed to an oversampled matrix of zeros. CG algorithm starts with W1, a gradient g , d and ql 0 (zero matrix), as indicated in Fig.1. αn andβn are computed using Wl, g , gand d, as described in ref.[2]. For each l, a CG loop (surrounded by dashed lines) is repeated until ql n is converged. An updated image is computed as xl = Wl ql . Therefore, a weighting matrix can also be updated for the next, i.e. (l+1)-th, iteration. MR experiments were performed to test Spiral FOCUSS using a 1.5 Tesla Siemens Sonata Scanner. Axial abdominal images were acquired from an asymptomatic volunteer. The spiral trajectories used in this experiment consisted of six interleaves. The acquired data satisfied approximately 50 % of the Nyquist limit. TE/TR=7.5/30.0ms, FOV=300mm. Images were reconstructed using the conventional gridding, Spiral FOCUSS, and CG-INNG algorithm [5]. For each of Spiral FOCUSS and CG-INNG, s = 8, N = 256, and the total number of iterations were 40. An image was also reconstructed from the data acquired with 12 interleaved spiral trajectories (the Nyquist criterion fulfilled) using conventional gridding for comparison. Results: Figure 2 (a-c) shows images reconstructed from the data acquired with six interleaves using (a) conventional gridding, (b) Spiral FOCUSS, and (c) CG-INNG algorithm. Figure 2 (d) is an image reconstructed from the data acquired with 12 interleaves. Aliasing artifacts observed in image (a) are significantly reduced in image (b) while substantial artifacts remain in image (c). Discussion and Conclusions: As seen in Fig.2(b,c), although both Spiral FOCUSS and CGINNG use CG, only CG does not help to reduce aliasing artifacts. When Fig.2(b) are compared with (d), (b) shows intensity variations, as observed in the liver. We suppose that the intensity variations resulted from data errors of low frequency k-space. Spiral trajectories with reduced interleaves violate the Nyquist criterion in the central k-space. Therefore, artifacts that originate from low frequency data often appear in the images and are usually difficult to remove. However, this type of artifacts can considerably be reduced if variable density (VD) spiral trajectories are used (the results not shown). VD spirals densely sample only at the k-space center and therefore the total acquisition time needs to be slightly extended. The newly proposed Spiral FOCUSS is a quite useful reconstruction technique for undersampled spiral trajectories. It permits faster spiral acquisition while maintaining image quality. Furthermore, Spiral FOCUSS can readily be combined with parallel imaging methods, thereby enabling even faster acquisition. Acknowledgements: Siemens Medical Solutions. References: [1] Pruessmann KP, et al. MRM 2001;46:638-651. [2] Ye JC, et al. MRM 2007;57:764-775. [3] Jackson JI, et al. IEEE TMI 1991;10:473-478. [4] Moriguchi H, et al. MRM 2004;51:343-352. [5] Moriguchi H, et al. Proc ISMRM 2006. p694. Fig.2. Reconstructed images a b
منابع مشابه
High resolution projection reconstruction MR imaging using FOCUSS
This paper is concerned about high resolution reconstruction of projection reconstruction MR imaging from angular under-sampled k-space data. A similar problem has been recently addressed in the framework of compressed sensing theory. Unlike the existing algorithms used in compressed sensing theory, this paper employs the FOCal Underdetermined System Solver(FOCUSS), which was originally designe...
متن کاملMagnetic Resonance in Medicine 57:764–775 (2007) Projection Reconstruction MR Imaging Using FOCUSS
The focal underdetermined system solver (FOCUSS) was originally designed to obtain sparse solutions by successively solving quadratic optimization problems. This article adapts FOCUSS for a projection reconstruction MR imaging problem to obtain high resolution reconstructions from angular undersampled radial k -space data. We show that FOCUSS is effective for projection reconstruction MRI, sinc...
متن کاملImproved BPE reconstruction using FOCUSS
Introduction: Bunched Phase Encoding (BPE) is a new type of fast data acquisition method in MRI that takes advantage of zigzag k-space trajectories along the PE direction (Fig.1)[1,2]. Sampling frequency of BPE is higher than that of normal acquisition. Since BPE acquisition scheme is comparable to acquiring multiple PE lines in a single readout, the total number of TR cycles and hence the scan...
متن کاملMotion estimated and compensated compressive sensing dynamic MRI under field inhomogeneity
Introduction: Recently, we proposed a compressed sensing dynamic MR technique called k-t FOCUSS that extends the conventional k-t BLAST/SNESE by exploiting the sparsity of x-f signal. Especially, we found that when a fully sampled reference frame is available more sophisticated prediction methods such as RIGR and motion estimation and compensation (ME/MC) can significantly sparsify the residual...
متن کاملImproved k-t FOCUSS using a sparse Bayesian learning
Introduction: In dynamic MRI, spatio-temporal resolution is a very important issue. Recently, compressed sensing approach has become a highly attracted imaging technique since it enables accelerated acquisition without aliasing artifacts. Our group has proposed an l1-norm based compressed sensing dynamic MRI called k-t FOCUSS which outperforms the existing methods. However, it is known that the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008